af9f3ab276b77b612485b37a5838ce2f6b7849c3,enterprise/src/main/java/org/neo4j/graphalgo/util/PriorityMap.java,PriorityMap,put,#E#P#,119
Before Change
{
K key = keyFunction.convert( entity );
Node<E, P> node = map.get( key );
if ( node != null && priority.equals( node.priority ) )
{
node.head = new Link<E>( entity, node.head );
}
else
{
node = new Node<E, P>( entity, priority );
map.put( key, node );
queue.add( node );
}
}
After Change
K key = keyFunction.convert( entity );
Node<E, P> node = map.get( key );
boolean result = false;
if ( node != null )
{
if ( priority.equals( node.priority ) )
{
node.head = new Link<E>( entity, node.head );
result = true;
}
else if ( order.compare( priority, node.priority ) < 0 )
{
queue.remove( node );
put( entity, priority, key );
result = true;
}
}
else
{
put( entity, priority, key );
result = true;
}
return result;